Parsing Beyond Context-Free Grammars
نویسنده
چکیده
The first € price and the £ and $ price are net prices, subject to local VAT. Prices indicated with * include VAT for books; the €(D) includes 7% for Germany, the €(A) includes 10% for Austria. Prices indicated with ** include VAT for electronic products; 19% for Germany, 20% for Austria. All prices exclusive of carriage charges. Prices and other details are subject to change without notice. All errors and omissions excepted. L. Kallmeyer Parsing Beyond Context-Free Grammars
منابع مشابه
Parsing of Context Free Languages
Parsing is the process of assigning structure to sentences The structure is obtained from the grammatical description of the language Both in Com puter Science and in Computational Linguistics context free grammars and associated parsing algorithms are among the most useful tools Numerous parsing algorithms have been developed Special subclasses of the context free grammars have been introduced...
متن کاملScannerless Boolean Parsing
Scannerless generalized parsing techniques allow parsers to be derived directly from unified, declarative specifications. Unfortunately, in order to uniquely parse existing programming languages at the character level, disambiguation extensions beyond the usual context-free formalism are required. This paper explains how scannerless parsers for boolean grammars (context-free grammars extended w...
متن کاملsbp: A Scannerless Boolean Parser
Scannerless generalized parsing techniques allow parsers to be derived directly from unified, declarative specifications. Unfortunately, in order to uniquely parse (disambiguate) existing programming languages, extensions beyond the usual contextfree formalism must be added to handle a number of specific cases. This paper describes sbp, a scannerless parser for boolean grammars, a superset of c...
متن کاملA Generalization of the Offline Parsable Grammars
The offline parsable grammars apparently have enough formal power to describe human language, yet the parsing problem for these grammars is solvable. Unfortunately they exclude grammars that use x-bar theory and these grammars have strong linguistic justification. We define a more general class of unification grammars, which admits x-bar grammars while preserving the desirable properties of off...
متن کاملFormal grammars for estimating partition functions of double-stranded chain molecules
This paper looks at an algorithm due to Chen and Dill for estimating the partition functions of a restricted subclass of double-stranded polymers, and shows how it can be translated into a context-free grammar, so that their algorithm reduces to a variant of the CKY parsing algorithm. Our formulation clarifies the structure of Chen and Dill’s algorithm, leading to revised complexity analyses an...
متن کامل